A Scalable Broadcast Algorithm for Multiport Meshes with Minimum Communication Steps
نویسندگان
چکیده
Many broadcast algorithms have been proposed for the mesh over the past decade. However, most of these algorithms do not exhibit good scalability properties as the network size increases. As a consequence, most existing broadcast algorithms cannot support real-world parallel applications that require large-scale system sizes due to their high computational demands. Motivated by these observations, this study proposes a new adaptive broadcast algorithm for the mesh. The unique feature of our algorithm is that it handles broadcast operations with a fixed number of message-passing steps irrespective of the network size. Our algorithm is based on the coded path routing, which has been proposed in [1]. Results from extensive comparative analysis reveal that the proposed algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling and Extending Dominating Node algorithms.
منابع مشابه
Girth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملEfficient broadcast and multicast on multistage interconnection networks using multiport encoding
This paper proposes a new approach for implementing fast multicast and broadcast in multistage interconnection networks (MINs) with multiport encoded multidestination worms. For a MIN with k k switches and n stages such worms usen header flits each. One flit is used for each stage of the network and it indicates the output ports to which a multicast message must be replicated. A single multipor...
متن کاملPipelined All-to-All Broadcast in All-Port Meshes and Tori
ÐAll-to-all communication is one of the most dense communication patterns and occurs in many important applications in parallel computing. In this paper, we present a new all-to-all broadcast algorithm in all-port meshes and tori. The algorithm utilizes a controlled message flooding based on a novel broadcast pattern, which ensures a balanced traffic load in all dimensions in the network so tha...
متن کاملTime-Step Optimal Broadcasting in 3-D Meshes with Minimum Total Communication Distance
In this paper we propose a new minimum total communication distance (TCD) algorithm and anoptimal TCD algorithm for broadcast in a 3-dimensional mesh (3-D mesh). The former generatesa minimum TCD from a given source node, and the latter guarantees a minimum TCD among allthe possible source nodes. These algorithms are based on a divide-and-conquer approach where a3-D mesh is ...
متن کاملParallel Multiplication of a Vector by a Kronecker Product of Matrices (Part II)
The paper provides a generalization of our previous algorithm for the parallel multiplication of a vector by a Kronecker product of matrices. For any p, a factor of the problem size, our algorithm runs on p processors with a minimum number of communication steps and memory space. Specifically, on p processors with global communication, we show that the multiplication requires at least Θ(log(p))...
متن کامل